Primality proofs with elliptic curves: heuristics and analysis
نویسندگان
چکیده
This paper deals with the heuristic running time analysis of the elliptic curve primality proving (ECPP) algorithm of Atkin and Morain. Our aim is to collect assumptions and the fastest possible algorithms to reduce the heuristic running time and to show that under these assumptions and some plausible conditions the heuristic running time can be reduced down to o(ln n) bit operation for input possible prime n.
منابع مشابه
Can we avoid tests for zero in fast elliptic-curve arithmetic?
This paper analyzes the exact extent to which 0 and ∞ cause trouble in Montgomery’s fast branchless formulas for x-coordinate scalar multiplication on elliptic curves of the form by = x + ax + x. The analysis shows that some multiplications and branches can be eliminated from elliptic-curve primality proofs and from elliptic-curve cryptography.
متن کاملPrimality Proving with Elliptic Curves
Elliptic curves are fascinating mathematical objects. In this paper, we present the way they have been represented inside the COQ system, and how we have proved that the classical composition law on the points is internal and gives them a group structure. We then describe how having elliptic curves inside a prover makes it possible to derive a checker for proving the primality of natural number...
متن کامل18 . 783 Elliptic Curves Spring 2013
Andrew V. Sutherland A key ingredient to improving the efficiency of elliptic curve primality proving (and many other algorithms) is the ability to directly construct an elliptic curve E/Fq with a specified number of rational points, rather than generating curves at random until a suitable curve is found. To do this we need to develop the theory of complex multiplication. Recall from Lecture 7 ...
متن کاملConstructing Elliptic Curves with a Given Number of Points
We describe how the theory of complex multiplication can be used to construct elliptic curves over a finite field with a given number of rational points and illustrate how this method can be applied to primality testing.
متن کاملApplications of elliptic curves in public key cryptography
The most popular public key cryptosystems are based on the problem of factorization of large integers and discrete logarithm problem in finite groups, in particular in the multiplicative group of finite field and the group of points on elliptic curve over finite field. Elliptic curves are of special interest since they at present alow much shorter keys, for the same level of security, compared ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014